On the interaction of adaptive timescales on networks
نویسندگان
چکیده
The dynamics of real-world systems often involve multiple processes that influence system state. The timescales that these processes operate on may be separated by orders of magnitude or may coincide closely. Where timescales are not separable, the way that they relate to each other will be important for understanding system dynamics. In this paper, we present a short overview of how modellers have dealt with multiple timescales and introduce a definition to formalise conditions under which timescales are separable. We investigate timescale separation in a simple model, consisting of a network of nodes on which two processes act. The first process updates the values taken by the network’s nodes, tending to move a node’s value towards that of its neighbours. The second process influences the topology of the network, by rewiring edges such that they tend to more often lie between similar individuals. We show that the behaviour of the system when timescales are separated is very different from the case where they are mixed. When the timescales of the two processes are mixed, the ratio of the rates of the two processes determines the systems equilibrium state. We go on to explore the impact of heterogeneity in the system’s timescales, i.e., where some nodes may update their value and/or neighbourhood faster than others, demonstrating that it can have a significant impact on the equilibrium behaviour of the model.
منابع مشابه
Iranian EFL Learners’ Motivational Fluctuation in Task Performance over Different Timescales
Motivation for learning a new language is both self and time-oriented. The language learner’s motivation experiences gradual fluctuation over time and the view of oneself is different on each timescale of the study. Interaction among different timescales throughout the Second Language Development (SLD) is a novel area of investigation (de Bot, 2015). In order to probe this interactive nature, t...
متن کاملOn the effect of low-quality node observation on learning over incremental adaptive networks
In this paper, we study the impact of low-quality node on the performance of incremental least mean square (ILMS) adaptive networks. Adaptive networks involve many nodes with adaptation and learning capabilities. Low-quality mode in the performance of a node in a practical sensor network is modeled by the observation of pure noise (its observation noise) that leads to an unreliable measurement....
متن کاملDistributed Incremental Least Mean-Square for Parameter Estimation using Heterogeneous Adaptive Networks in Unreliable Measurements
Adaptive networks include a set of nodes with adaptation and learning abilities for modeling various types of self-organized and complex activities encountered in the real world. This paper presents the effect of heterogeneously distributed incremental LMS algorithm with ideal links on the quality of unknown parameter estimation. In heterogeneous adaptive networks, a fraction of the nodes, defi...
متن کاملImpacts of the Negative-exponential and the K-distribution modeled FSO turbulent links on the theoretical and simulated performance of the distributed diffusion networks
Merging the adaptive networks with the free space optical (FSO) communication technology is a very interesting field of research because by adding the benefits of this technology, the adaptive networks become more efficient, cheap and secure. This is due to the fact that FSO communication uses unregistered visible light bandwidth instead of the overused radio spectrum. However, in spite of all ...
متن کاملOptimal Placement and Sizing of DGs and Shunt Capacitor Banks Simultaneously in Distribution Networks using Particle Swarm Optimization Algorithm Based on Adaptive Learning Strategy
Abstract: Optimization of DG and capacitors is a nonlinear objective optimization problem with equal and unequal constraints, and the efficiency of meta-heuristic methods for solving optimization problems has been proven to any degree of complex it. As the population grows and then electricity consumption increases, the need for generation increases, which further reduces voltage, increases los...
متن کاملAn Adaptive LEACH-based Clustering Algorithm for Wireless Sensor Networks
LEACH is the most popular clastering algorithm in Wireless Sensor Networks (WSNs). However, it has two main drawbacks, including random selection of cluster heads, and direct communication of cluster heads with the sink. This paper aims to introduce a new centralized cluster-based routing protocol named LEACH-AEC (LEACH with Adaptive Energy Consumption), which guarantees to generate balanced cl...
متن کامل